#include<bits/stdc++.h>
using namespace std;

const int N=101000;
int a[N],vis[N];
int n,ans=0;

int main(){

    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    memset(vis,0,sizeof(vis));

    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];
    sort(a,a+n);

    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(a[i]!=a[j] && vis[j]==0){
                vis[j]=1;
                ans++;
                break;
            }
        }
    }
    cout<<n-ans;
    return 0;
}

